#include <iostream>
#include<unordered_map>
using namespace std;
typedef unsigned long long ull;
unordered_map<ull,int>um;
int fun(ull n){
  ull t=n/2;
  int count=2;
  for(int i=1;i<=t;i++)
    if(n%i==0){
      t=n/i;
      if(t==i) count++;
      else count+=2;
    }
    return count;
}
int main()
{
  int k=0,n=0;
  ull i, s=10000000;
  ull t=s;
  for(i=1000;i<t;i+=10){
    k=fun(i);
    if(k>300){
      um[i]=k;
      // break;
    }
  }
  for(auto val:um){
    n++;
    cout<<val.first<<"\t"<<val.second<<endl;
  }
  cout<<n<<endl;
  return 0;
}